From regular lattice to scale free network
نویسنده
چکیده
The Watts-Strogatz algorithm of transferring the square lattice to a small world network is modified by introducing preferential rewiring constrained by connectivity demand. The evolution of the network is two-step: sequential preferential rewiring of edges controlled by p and updating the information about changes done. The evolving system self-organizes into stationary states. The topological transition in the graph structure is noticed with respect to p. Leafy phase a graph formed by multiple connected vertices (graph skeleton) with plenty of leaves attached to each skeleton vertex emerges when p is small enough to pretend asynchronous evolution. Tangling phase where edges of a graph circulate frequently among low degree vertices occurs when p is large. There exist conditions at which the resulting stationary network ensemble provides networks which degree distribution exhibit power-law decay in large interval of degrees. PACS: 02.50.Ey, 89.75.Fb, 89.20.Ff
منابع مشابه
An Irregular Lattice Pore Network Model Construction Algorithm
Pore network modeling uses a network of pores connected by throats to model the void space of a porous medium and tries to predict its various characteristics during multiphase flow of various fluids. In most cases, a non-realistic regular lattice of pores is used to model the characteristics of a porous medium. Although some methodologies for extracting geologically realistic irregular net...
متن کاملEpidemic spreading in a scale-free network of regular lattices
The susceptible-infected-susceptible (SIS) epidemics in a scale-free network in which each node is a square lattice itself is investigated through large-scale computer simulations. The model combines a local contact process among individuals in a node (or city) with stochastic long-range infections due to people traveling between cities interconnected by the national transportation scale-free n...
متن کاملTransport Properties of Random Walks on Scale-Free/Regular-Lattice Hybrid Networks
We study numerically the mean access times for random walks on hybrid disordered structures formed by embedding scale-free networks into regular lattices, considering different transition rates for steps across lattice bonds (F ) and across network shortcuts (f ). For fast shortcuts (f/F 1) and low shortcut densities, traversal time data collapse onto a universal curve, while a crossover behavi...
متن کاملQuantum Strategies Win in a Defector-Dominated Population
Quantum strategies are introduced into evolutionary games. The agents using quantum strategies are regarded as invaders whose fraction generally is 1% of a population in contrast to the 50% defectors. In this paper, the evolution of strategies on networks is investigated in a defector-dominated population, when three networks (Regular Lattice, Newman-Watts small world network, scale-free networ...
متن کاملRegularity in residuated lattices
In this paper, we study residuated lattices in order to give new characterizations for dense, regular and Boolean elements in residuated lattices and investigate special residuated lattices in order to obtain new characterizations for the directly indecomposable subvariety of Stonean residuated lattices. Free algebra in varieties of Stonean residuated lattices is constructed. We introduce in re...
متن کاملHow the initial level of visibility and limited resource affect the evolution of cooperation
This work sheds important light on how the initial level of visibility and limited resource might affect the evolution of the players' strategies under different network structure. We perform the prisoner's dilemma game in the lattice network and the scale-free network, the simulation results indicate that the average density of death in lattice network decreases with the increases of the initi...
متن کامل